Zagreb Connection Number Index of Nanotubes and Regular Hexagonal Lattice
نویسندگان
چکیده
منابع مشابه
The augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملHexagonal lattices and nanotubes
We consider a Fröhlich-type Hamiltonian on a hexagonal lattice. Aiming to describe nanotubes, we choose this 2-dimensional lattice to be periodic and to have a large extension in one (x) direction and a small extension in the other (y) direction. We study the existence of solitons in this model using both analytical and numerical methods. We find exact solutions of our equations and discuss som...
متن کاملThe First and Second Zagreb Indices, First and Second Zagreb Polynomials of HAC5C6C7[p,q] and HAC5C7[p,q] Nanotubes
Topological indices are numerical parameters of a molecular graph G which characterize its topology. On the other hands, computing the connectivity indices of molecular graphs is an important branch in chemical graph theory. Therefore, we compute First Zagreb index Zg <span style="font-family: TimesNewRomanPS-Italic...
متن کاملThe Hyper-Zagreb Index of Graph Operations
Let G be a simple connected graph. The first and second Zagreb indices have been introduced as vV(G) (v)2 M1(G) degG and M2(G) uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G) (degG(u) degG In this paper, the HyperZagreb index of the Cartesian p...
متن کاملgraphs with fixed number of pendent vertices and minimal first zagreb index
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Chemistry
سال: 2019
ISSN: 2391-5420
DOI: 10.1515/chem-2019-0007